class Solution {
    public int[] twoSum(int[] price, int target) {
        int left = 0;
        int right = price.length-1;
        int[] ret = new int[2];
        while (left != right) {//
            if (price[left]+ price[right] < target) {
                left++;
            }else if (price[left]+ price[right] > target){
                right--;
            }else {
                ret[0] = price[left];
                ret[1] = price[right];
                break;
            }
        }
        return ret;
    }
}